Enhancing histograms by tree-like bucket indices
نویسندگان
چکیده
منابع مشابه
Choosing Bucket Boundaries for Histograms
Histograms have long been used to capture attribute value distribution statistics for query optimizers. More recently, there has been a growing interest in the use of histograms to produce quick approximate answers to decision support queries. This motivates nding good strategies for specifying histogram buckets. Under the assumption that nding optimal bucket boundaries is computationally ineec...
متن کاملReducing Data Stream Sliding Windows by Cyclic Tree-Like Histograms
Data reduction is a basic step in a KDD process useful for delivering to successive stages more concise and meaningful data. When mining is applied to data streams, that are continuous data flows, the issue of suitably reducing them is highly interesting, in order to arrange effective approaches requiring multiple scans on data, that, in such a way, may be performed over one or more reduced sli...
متن کاملGeometric Bucket Trees: Analysis of Linear Bucket Tree
We analyse the average number of buckets in a Linear Bucket tree created by n points uniformly dispatched on an interval of length y. A new bucket is created when a point does not fall in an existing bucket. The bucket is the interval of length 2 centered on the point. We illustrate this concept by an interesting tale of how the moon’s surface took on its present form. Thanks to an explicit Lap...
متن کاملCompressed histograms with arbitrary bucket layouts for selectivity estimation
Recent multidimensional histogram techniques such as GenHist and STHoles use an arbitrary bucket layout. This layout has the advantage of requiring a smaller number of buckets to model tuple densities than those required by the traditional grid or recursive layouts. However, the arbitrary bucket layout brings an inherent disadvantage of requiring more memory to store each bucket location inform...
متن کاملApproximating sliding windows by cyclic tree-like histograms for efficient range queries
The issue of providing fast approximate answers to range queries on sliding windows with a small consumption of storage space is one of the main challenges in the context of data streams. On the one hand, the importance of this class of queries is widely accepted. They are indeed useful to compute aggregate information over the data stream, allowing us to extract from it more abstract knowledge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The VLDB Journal
سال: 2007
ISSN: 1066-8888,0949-877X
DOI: 10.1007/s00778-007-0050-5